ilu and iul factorizations obtained from forward and backward factored approximate inverse algorithms
Authors
abstract
in this paper, an efficient dropping criterion has been used to compute the iul factorization obtained from backward factored approximate inverse (bfapinv) and ilu factorization obtained from forward factored approximate inverse (ffapinv) algorithms. we use different drop tolerance parameters to compute the preconditioners. to study the effect of such a dropping on the quality of the ilu and iul factorizations, we have used the preconditioners as the right preconditioners for several linear systems and then, the krylov subspace methods have been used to solve the preconditioned systems. to avoid storing matrix $a$ in two csr and csc formats, the linked lists trick has been used in the implementations. as the preprocessing, the multilevel nested dissection reordering has also been used.
similar resources
ILU and IUL factorizations obtained from forward and backward factored approximate inverse algorithms
In this paper, an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms. We use different drop tolerance parameters to compute the preconditioners. To study the effect of such a dropping on the quality of the ILU ...
full textDifferent Versions of ILU and IUL Factorizations Obtained from Forward and Backward Factored Approximate Inverse Processes - Part I
We present an incomplete UL IUL decomposition of matrixAwhich is extracted as a by-product of BFAPINV backward factored approximate inverse process. We term this IUL factorization as IULBF. We have used ILUFF 3 and IULBF as left preconditioner for linear systems. Different versions of ILUFF and IULBF preconditioners are computed by using different dropping techniques. In this paper, we compare ...
full textComplete pivoting strategy for the $IUL$ preconditioner obtained from Backward Factored APproximate INVerse process
In this paper, we use a complete pivoting strategy to compute the IUL preconditioner obtained as the by-product of the Backward Factored APproximate INVerse process. This pivoting is based on the complete pivoting strategy of the Backward IJK version of Gaussian Elimination process. There is a parameter $alpha$ to control the complete pivoting process. We have studied the effect of dif...
full textA Factored Approximate Inverse Preconditioner with Pivoting
In this paper we develop new techniques for stabilizing factored approximate inverse preconditioners (AINV) using pivoting. This method yields stable preconditioners in many cases and can provide successful preconditioners in many situations when the underlying system is highly indefinite. Numerical examples illustrate the effectiveness of this approach.
full textForward and Backward Uncertainty Quantification in Optimization
This contribution gathers some of the ingredients presented during the Iranian Operational Research community gathering in Babolsar in 2019.It is a collection of several previous publications on how to set up an uncertainty quantification (UQ) cascade with ingredients of growing computational complexity for both forward and reverse uncertainty propagation.
full textAccelerated and Inexact Forward-Backward Algorithms
We propose a convergence analysis of accelerated forward-backward splitting methods for composite function minimization, when the proximity operator is not available in closed form, and can only be computed up to a certain precision. We prove that the 1/k2 convergence rate for the function values can be achieved if the admissible errors are of a certain type and satisfy a sufficiently fast deca...
full textMy Resources
Save resource for easier access later
Journal title:
bulletin of the iranian mathematical societyPublisher: iranian mathematical society (ims)
ISSN 1017-060X
volume 40
issue 5 2014
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023